Building Secure Cryptographic Transforms, or How to Encrypt and MAC

نویسندگان

  • Tadayoshi Kohno
  • Adriana Palacio
  • John Black
چکیده

We describe several notions of “cryptographic transforms,” symmetric schemes designed tomeet a variety of privacy and authenticity goals. We consider goals, such as replay-avoidanceand in-order packet delivery, that have not been fully addressed in previous works in this area.We then provide an analysis of possible ways to combine standard encryption and messageauthentication schemes in order to provably meet these goals. Our results further narrow thegap between the provable-security results from the theoretical community and the needs ofdevelopers who implement real systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)

We study the question of how to generically compose symmetric encryption and authentication when building “secure channels” for the protection of communications over insecure networks. We show that any secure channels protocol designed to work with any combination of secure encryption (against chosen plaintext attacks) and secure MAC must use the encrypt-then-authenticate method. We demonstrate...

متن کامل

FendOff encryption software to secure personal information on computers and mobile devices

The paper describes several original cryptographic cipher modules (VSEM) that are based on using one time pseudorandom pad and pseudorandom transpositions. The VSEM includes 4 modules of encryption that can be applied in combinations. We studied ability of these modules to secure the private data against attacks and their speed of encryption. The VSEM encryption was implemented in Fendoff appli...

متن کامل

MDx-MAC and Building Fast MACs from Hash Functions

We consider the security of message authentication code (MAC) algorithms, and the construction of MACs from fast hash functions. A new forgery attack applicable to all iterated MAC algorithms is described, the first known such attack requiring fewer operations than exhaustive key search. Existing methods for constructing MACs from hash functions, including the secret prefix, secret suffix, and ...

متن کامل

Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing

Standard constructions of garbled circuits provide only static security, meaning the input x is not allowed to depend on the garbled circuit F . But some applications—notably one-time programs (Goldwasser, Kalai, and Rothblum 2008) and secure outsourcing (Gennaro, Gentry, Parno 2010)— need adaptive security, where x may depend on F . We identify gaps in proofs from these papers with regard to a...

متن کامل

π-Cipher: Authenticated Encryption for Big Data

In today’s world of big data and rapidly increasing telecommunications, using secure cryptographic primitives that are parallelizable and incremental is becoming ever more important design goal. π-Cipher is parallel, incremental, nonce based authenticated encryption cipher with associated data. It is designed with the special purpose of providing confidentiality and integrity for big data in tr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2003  شماره 

صفحات  -

تاریخ انتشار 2003